| 翻訳と辞書 |
cycle graph
In graph theory, a cycle graph or circular graph is a graph that consists of a single cycle, or in other words, some number of vertices connected in a closed chain. The cycle graph with ''n'' vertices is called ''Cn''. The number of vertices in ''Cn'' equals the number of edges, and every vertex has degree 2; that is, every vertex has exactly two edges incident with it.
==Terminology==
There are many synonyms for "cycle graph". These include simple cycle graph and cyclic graph, although the latter term is less often used, because it can also refer to graphs which are merely not acyclic. Among graph theorists, cycle, polygon, or ''n''-gon are also often used. A cycle with an even number of vertices is called an even cycle; a cycle with an odd number of vertices is called an odd cycle.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「cycle graph」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|